The distinguishing number of groups based on the distinguishing number of subgroups
نویسندگان
چکیده
The distinguishing number D(G) of a graph G is the least integer d such that has vertex labeling with labels preserved only by trivial automorphism. Let ? be group acting on set X. for this action X, denoted D? (X), smallest natural k elements X can labeled so any label-preserving element fixes all x ? In particular, if faithful, then preserving identity. paper, we obtain an upper bound knowing under subgroup. By concept motion, group. Also study D?, H (X) which admitting induce permutations lie in H.
منابع مشابه
The relationship between the distinguishing number and the distinguishing index with detection number of a graph
This article has no abstract.
متن کاملThe number of Fuzzy subgroups of some non-abelian groups
In this paper, we compute the number of fuzzy subgroups of some classes of non-abeilan groups. Explicit formulas are givenfor dihedral groups $D_{2n}$, quasi-dihedral groups $QD_{2^n}$, generalized quaternion groups $Q_{4n}$ and modular $p$-groups $M_{p^n}$.
متن کاملDistinguishing number and distinguishing index of natural and fractional powers of graphs
The distinguishing number (resp. index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (resp. edge labeling) with $d$ labels that is preserved only by a trivial automorphism. For any $n in mathbb{N}$, the $n$-subdivision of $G$ is a simple graph $G^{frac{1}{n}}$ which is constructed by replacing each edge of $G$ with a path of length $n$...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملThe Distinguishing Chromatic Number
In this paper we define and study the distinguishing chromatic number, χD(G), of a graph G, building on the work of Albertson and Collins who studied the distinguishing number. We find χD(G) for various families of graphs and characterize those graphs with χD(G) = |V (G)|, and those trees with the maximum chromatic distingushing number for trees. We prove analogs of Brooks’ Theorem for both the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information and Optimization Sciences
سال: 2022
ISSN: ['2169-0103', '0252-2667']
DOI: https://doi.org/10.1080/02522667.2021.2003011